Image Inpainting Through Quality Based Patch Selection Matrix
نویسندگان
چکیده
Image inpainting refers to the set of techniques which include filling-in of missing area (known as holes) in a picture such that modifications made to the picture are unnoticeable. The algorithms for image inpainting that are proposed in the literature are rooted on the concept to fill-in the holes by means of available information in the surroundings. This information can be automatically detected or hinted by the user. This paper propose a modified Criminisi’s exempler based image-inpainting method in which quality based patch selection is performed in the process of inpainting of digital images to recover the lost part of the image in a visually plausible way such that the changes made to the image are not detected by the normal user. Here, a measure of SSIM (Structural Similarity Index Metrics) is integrated in the process of inpainting, where, confidence term, data term and priorities for the patches are based on SSIM index that compares local patterns of pixel intensities that have been normalized for luminance and contrast. After the image-inpainting is completed using this proposed modified criminisi’s inpainting algorithm, a single-image superresolution (SR) approach is employed to enhance the resolution of the inpainted image consequently improving the quality of the resulting image. IndexTerms Image-inpainting, Image-processing, texture-synthesis, super-resolution, ssim ________________________________________________________________________________________________________
منابع مشابه
Improving Exemplar-based Image Completion methods using Selecting the Optimal Patch
Image completion is one of the subjects in image and video processing which deals with restoration of and filling in damaged regions of images using correct regions. Exemplar-based image completion methods give more pleasant results than pixel-based approaches. In this paper, a new algorithm is proposed to find the most suitable patch in order to fill in the damaged parts. This patch selection ...
متن کاملEffective Image and Video Error Concealment using RST-Invariant Partial Patch Matching Model and Exemplar-based Inpainting
An effective visual error concealment method has been presented by employing a robust rotation, scale, and translation (RST) invariant partial patch matching model (RSTI-PPMM) and exemplar-based inpainting. While the proposed robust and inherently feature-enhanced texture synthesis approach ensures the generation of excellent and perceptually plausible visual error concealment results, the outl...
متن کاملRobust Patch Estimation for Exemplar-based Image Inpainting
The exemplar-based image inpainting algorithm consists of two procedures: patch selection and patch estimation. In this paper, we focus on the latter. Conventional exemplar-based approaches cannot fully exploit the information existing in the image, which makes the patch estimation unstable and produces false colors and artifacts. In this paper, we propose a robust patch estimation algorithm fo...
متن کاملOptimum Patch Selection Using GA in Exemplar Based Image In-painting
Image in-painting is the art of restoring lost and selected parts of an image based on the background information in such a way so that the change is not observed by the observer. Image In-painting is very important and emerging field of research in image processing. Image Inpainting algorithm have numerous applications such as rebuilding of damaged photographs & films, heritage preservation, r...
متن کاملNonlocal Patch-based Image Inpainting through Minimization of a Sparsity Promoting Nonconvex Functional
We propose a convex model for nonlocal image inpainting that fills in missing or damaged areas with different convex combinations of available image patches. The visual quality of inpainted solutions is much better when patches are copied instead of averaged, and we show how this can be achieved by adding a nonconvex sparsity promoting penalty. To promote sparsity of a variable that is constrai...
متن کامل